The number of keys in relational and nested relational databases
نویسندگان
چکیده
منابع مشابه
The Number of Keys in Relational and Nested Relational Databases
Thalheim, B., The number of keys in relational and nested relational databases, Discrete Applied Mathematics 40 (1992) 265-282. Combinatorial propositions, concerning the maximal number of minimal keys are considered. It is shown that the results of Demetrovics about the maximal number of minimal keys on unbounded domains do not hold for finite domains. Using this result lower bounds for the si...
متن کاملRelational Databases in RDF: Keys and Foreign Keys
Today, most of the data on the web resides in relational databases. To make the data available for the semantic web mappings into RDF can be used. Such mappings should preserve the information about the structure of keys and foreign keys, because otherwise important semantic information is lost. In this paper, we discuss several possible ways to map relational databases into an RDF graph. We di...
متن کاملError-Correcting Keys in Relational Databases
Suppose that the entries of a relational database are collected in an unreliable way, that is the actual database may differ from the true database in at most one data of each individual. An error-correcting key is such a set of attributes, that the knowledge of the actual data of an individual in this set of attributes uniquely determines the individual. It is showed that if the minimal keys a...
متن کاملAn Implementation for Nested Relational Databases
1 Introductim We propose an architecture for implementing nested relational databases. In particular, we discuss the storage structures, their organization and an access language for specifying access plans. The featurw of our implementation are: In this paper we propose an implementation, ANDA’ for the Nested Relational Data Model(NRJ3M). In partitular, we diicuaa the storage structures, their...
متن کاملMultiple Path Join for Nested Relational Databases
This paper presents a solution to the problem of how to eeciently process queries which include join operations in the nested relational model. We focus on the join operation, and introduce a new join operator called P-join. The P-join operator merges two scheme trees. It combines the advantages of the extended natural join and recursive join for eecient data access. The algebraic expression of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90033-7